Hamiltonian Cycles in the Square of a Graph
نویسنده
چکیده
We show that under certain conditions the square of the graph obtained by identifying a vertex in two graphs with hamiltonian square is also hamiltonian. Using this result, we prove necessary and sufficient conditions for hamiltonicity of the square of a connected graph such that every vertex of degree at least three in a block graph corresponds to a cut vertex and any two these vertices are at distance at least four.
منابع مشابه
Cayley graph associated to a semihypergroup
The purpose of this paper is the study of Cayley graph associated to a semihypergroup(or hypergroup). In this regards first we associate a Cayley graph to every semihypergroup and then we study theproperties of this graph, such as Hamiltonian cycles in this graph. Also, by some of examples we will illustrate the properties and behavior of these Cayley graphs, in particulars we show that ...
متن کاملOn cycles in intersection graphs of rings
Let $R$ be a commutative ring with non-zero identity. We describe all $C_3$- and $C_4$-free intersection graph of non-trivial ideals of $R$ as well as $C_n$-free intersection graph when $R$ is a reduced ring. Also, we shall describe all complete, regular and $n$-claw-free intersection graphs. Finally, we shall prove that almost all Artin rings $R$ have Hamiltonian intersection graphs. ...
متن کاملGeometric-Arithmetic Index of Hamiltonian Fullerenes
A graph that contains a Hamiltonian cycle is called a Hamiltonian graph. In this paper we compute the first and the second geometric – arithmetic indices of Hamiltonian graphs. Then we apply our results to obtain some bounds for fullerene.
متن کاملInduced S(K1, 3) and hamiltonian cycles in the square of a graph
We show that under certain conditions the square of the graph obtained by identifying a vertex in two graphs with hamiltonian square is also hamiltonian. Using this result, we prove necessary and sufficient conditions for hamiltonicity of the square of a connected graph such that every vertex of degree at least three in a block graph corresponds to a cut vertex and any two these vertices are at...
متن کاملA Hamiltonian Cycle in the Square of a 2-connected Graph in Linear Time
Fleischner's theorem says that the square of every 2-connected graph contains a Hamiltonian cycle. We present a proof resulting in an O(|E|) algorithm for producing a Hamiltonian cycle in the square G of a 2connected graph G = (V,E). More generally, we get an O(|E|) algorithm for producing a Hamiltonian path between any two prescribed vertices, and we get an O(|V |) algorithm for producing cycl...
متن کامل